Interpolating classical partitions of the set of positive integers
نویسندگان
چکیده
منابع مشابه
On additive partitions of sets of positive integers
Consider any set U = (u,,} with elements defined by u,, +? = u,, +, + u,,, n z 1, where u, and u2 are relatively prime positive integers. We show that if u, Cu, or 2 ( u,uz, then the set of positive integers can be partitioned uniquely into two disjoint sets such that the sum of any two distinct memhers of any one set is never in U. If U,>LQ and 21 u,uz. no such partition is possible. Further r...
متن کاملPartitions of positive integers into sets without infinite progressions
We prove a result which implies that, for any real numbers a and b satisfying 0 ≤ a ≤ b ≤ 1, there exists an infinite sequence of positive integers A with lower density a and upper density b such that the sets A and N \ A contain no infinite arithmetic and geometric progressions. Furthermore, for any m ≥ 2 and any positive numbers a1, . . . , am satisfying a1 + · · · + am = 1, we give an explic...
متن کاملCommunal Partitions of Integers
There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1/(k−1) of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in th...
متن کاملOn additive partitions of integers
The aim of this paper is to prove that given a linear recurrence sequence U = kb u„ +z = u„ + , + u„, n w 1, u t =1, uz > u l , then the set of positive integers can be partitioned uniquely into two disjoint subsets such that the sum of any two distinct members from any one set can never be in U and study related problems . We prove our main result in Section 2. In Section 3 we give a graph the...
متن کاملCrossings and Nestings in Set Partitions of Classical Types
We study bijections { Set partitions of type X } −̃→ { Set partitions of type X } for X ∈ {A,B,C,D}, which preserve openers and closers. In types A, B, and C, they interchange • either the number of crossings and of nestings, • or the cardinalities of a maximal crossing and of a maximal nesting. In type D, the results are obtained only in the case of non-crossing and nonnesting set partitions. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Ramanujan Journal
سال: 2020
ISSN: 1382-4090,1572-9303
DOI: 10.1007/s11139-019-00196-3